A Path Order for Rewrite Systems that Compute Exponential Time Functions
نویسندگان
چکیده
In this paper we present a new path order for rewrite systems, the exponential path order EPO. Suppose a term rewrite system is compatible with EPO, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPO equals the class of functions computable in exponential time on a Turing machine. 1998 ACM Subject Classification F.2.2, F.4.1, F.4.2, D.2.4, D.2.8
منابع مشابه
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
In this paper we present a new path order for rewrite systems, the exponential path order EPO ⋆. Suppose a term rewrite system R is compatible with EPO ⋆ , then the runtime complexity of R is bounded from above by an exponential function. Further, the class of function computed by a rewrite system compatible with EPO ⋆ equals the class of functions computable in exponential time on a Turing mac...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملPolynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP, that is applicable in two related, but distinct contexts. On the one hand POP induces polynomial innermost runtime complexity and hence may serve as a syntactic, and full...
متن کاملA Termination Ordering for Higher Order Rewrite Systems
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate su cient properties of the termination functions for our method to apply. Thereby we describe a class of di erent orderings. Finally we compare our method to previously published extension...
متن کاملA Termination Ordering for Higher Order Rewrite System
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate the necessary properties of the termination functions for our method to apply, thus describe a class of diierent orderings. We also give a counterexample to a previously published extensio...
متن کامل